/*
https://leetcode.cn/problems/minimum-path-sum/submissions/584671431/?envType=problem-list-v2&envId=dynamic-programming
64. 最小路径和
*/
class Solution {
public:
    int minPathSum(vector<vector<int>>& grid) {
        int m = grid.size()-1;
        int n = grid[0].size()-1;
        if (m == -1 || n == -1) {
        return 0;
    }
    int dp[m+1][n+1];
    dp[0][0] = grid[0][0];
      for(int i = 1; i <= m; i++){
      dp[i][0] = dp[i-1][0] + grid[i][0];
    }
      for(int i = 1; i <= n; i++){
      dp[0][i] = dp[0][i-1] + grid[0][i];
    }
    for(int i=1;i<=m;++i){
        for(int j=1;j<=n;++j){
            dp[i][j]=min(dp[i-1][j],dp[i][j-1])+grid[i][j];
        }
    }
        return dp[m][n];
    }
};